Computable error bounds with improved applicability conditions for collocation methods
نویسندگان
چکیده
منابع مشابه
Direct Error Bounds for Symmetric Rbf Collocation
The standard error bounds for interpolation by kernels or radial basis functions are generalized to symmetric PDE collocation problems. This involves generalized Power Functions, and these can be explicitly calculated. Final error bounds then are a product of Power Function values and the norm of the solution in the native space of the kernel. Since the latter can also be estimated well, the wh...
متن کاملSufficient Conditions for Error Bounds
For a lower semicontinuous (l.s.c.) inequality system on a Banach space, it is shown that error bounds hold, provided every element in an abstract subdifferential of the constraint function at each point outside the solution set is norm bounded away from zero. A sufficient condition for a global error bound to exist is also given for an l.s.c. inequality system on a real normed linear space. It...
متن کاملAn improved collocation method based on deviation of the error for solving BBMB equation
In this paper, we improve b-spline collocation method for Benjamin-Bona-Mahony-Burgers (BBMB) by using defect correction principle. The exact finite difference scheme is used to find defect and the defect correction principle is used to improve collocation method. The method is tested on somemodel problems and the numerical results have been obtained and compared.
متن کاملComputable backward error bounds for basic algorithms in linear algebra
Standard error estimates in numerical linear algebra are often of the form γk|R||S| where R,S are known matrices and γk := ku/(1−u) with u denoting the relative rounding error unit. Recently we showed that for a number of standard problems γk can be replaced by ku for any order of computation and without restriction on the dimension. Such problems include LUand Cholesky decomposition, triangula...
متن کاملImproved error bounds for underdetermined system solvers
The minimal 2-norm solution to an underdetermined system Ax b of full rank can be computed using a QR factorization of AT in two different ways. One method requires storage and reuse of the orthogonal matrix Q, while the method of seminormal equations does not. Existing error analyses show that both methods produce computed solutions whose normwise relative error is bounded to first order by ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1998
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171298000519